A general approach to list decoding

نویسندگان

  • Nir Elkayam
  • Meir Feder
چکیده

In [1] we derived one shot achievable and converse bounds with possible mismatched decoding. In this paper, we extend the results to the list decoding case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Probabilistic Lower Bound on the Max- imum Size of a List-of-Two Decodable Code

List decoding of block codes is a decoding strategy which potentially allows better utilization of the error-correction capability of the code being decoded than traditional decoding up to half the minimum distance of the code. The basic idea dates back to 1957 but has fairly recently been the object of renewed interest from the research community, after the development of efficient algorithms ...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES List Decoding − Random Coding Exponents and Expurgated Exponents

Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size L. Two asymptotic regimes are considered, the fixed list–size regime, where L is fixed independently of the block length n, and the exponential list–size, where L grows exponentially with n. We first derive a general upper bound on the list–decoding ave...

متن کامل

Cyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rate

Algebraic error-correcting codes that achieve the optimal trade-off between rate and fraction of errors corrected (in the model of list decoding) were recently constructed by a careful “folding” of the Reed-Solomon code. The “low-degree” nature of this folding operation was crucial to the list decoding algorithm. We show how such folding schemes useful for list decoding arise out of the Artin-F...

متن کامل

Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice

Recently, Augot and Finiasz presented a coding theoretic public key cryptosystem that suggests a new approach for designing such systems based on the Polynomial Reconstruction Problem. Their cryptosystem is an instantiation of this approach under a specific choice of parameters which, given the state of the art of coding theory, we show in this work to be sub-optimal. Coron showed how to attack...

متن کامل

A Hybrid Machine Translation System Based on a Monotone Decoder

In this paper, a hybrid Machine Translation (MT) system is proposed by combining the result of a rule-based machine translation (RBMT) system with a statistical approach. The RBMT uses a set of linguistic rules for translation, which leads to better translation results in terms of word ordering and syntactic structure. On the other hand, SMT works better in lexical choice. Therefore, in our sys...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017